Affine Algebraic Monoids as Endomorphisms’ Monoids of Finite-dimensional Algebras
نویسنده
چکیده
We prove that any affine algebraic monoid can be obtained as the endomorphisms’ monoid of a finite-dimensional (nonassociative) algebra.
منابع مشابه
Simplicial Endomorphisms
A presentation by generators and relations is given for the monoids of endomorphisms in the simplicial category. These monoids are submonoids of monoids one finds in Temperley-Lieb algebras, and as the monoids of Temperley-Lieb algebras are linked to situations where an endofunctor is adjoint to itself, so the monoids of simplicial endomorphisms axiomatized here are linked to arbitrary adjoint ...
متن کاملEilenberg-Moore Monoids and Backtracking Monad Transformers
We develop an algebraic underpinning of backtracking monad transformers in the general setting of monoidal categories. As our main technical device, we introduce Eilenberg–Moore monoids, which combine monoids with algebras for strong monads. We show that Eilenberg–Moore monoids coincide with algebras for the list monad transformer (‘done right’) known from Haskell libraries. From this, we obtai...
متن کاملAn Eilenberg Theorem for Arbitrary Languages
In algebraic language theory one investigates formal languages by relating them to finite algebras. The most important result along these lines is Eilenberg’s celebrated variety theorem [7]: varieties of languages (classes of regular finite-word languages closed under boolean operations, derivatives and preimages of monoid morphisms) correspond bijectively to pseudovarieties of monoids (classes...
متن کاملCategorical Formulation of Finite-dimensional C*-algebras
We develop the concept of an involution monoid, and use it to show that finite-dimensional C*-algebras are the same as special unitary †-Frobenius monoids in the category of finite-dimensional complex Hilbert spaces. This gives a new, geometrical definition of finite-dimensional C*-algebras, contrasting with the conventional algebraic one.
متن کاملClasses of Fuzzy Filters of Residuated Lattice Ordered Monoids
The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (Rl-monoids) are common generalizations of BL-algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain i...
متن کامل